Using shortest path to discover criminal community
نویسندگان
چکیده
منابع مشابه
Using shortest path to discover criminal community
Extracting communities using existing community detection algorithms yields dense sub-networks that are difficult to analyse. Extracting a smaller sample that embodies the relationships of a list of suspects is an important part of the beginning of an investigation. In this paper, we present the efficacy of our shortest paths network search algorithm (SPNSA) that begins with an ‘algorithm feed’...
متن کاملUsing Shortest Path Algorithms to Identify Criminal Associations
Frequently in criminal investigations, law enforcement agencies face the problem of identifying associations between a group of entities such as individuals and organizations. In this paper we present a link analysis technique to solve such a problem. This approach uses shortest path algorithms to find the strongest associations between two or more given entities. The experimental results have ...
متن کاملFighting organized crimes: using shortest-path algorithms to identify associations in criminal networks
Effective and efficient link analysis techniques are needed to help law enforcement and intelligence agencies fight organized crimes such as narcotics violation, terrorism, and kidnapping. In this paper, we propose a link analysis technique that uses shortest-path algorithms, priority-first-search (PFS) and two-tree PFS, to identify the strongest association paths between entities in a criminal...
متن کاملUsing Quadrilaterals to Compute the Shortest Path
We introduce a new heuristic for the A* algorithm that references a data structure of size θ(|L| + |V |), where L represents a set of strategically chosen landmark vertices and V the set of vertices in the graph. This heuristic’s benefits are permitted by a new approach for computing landmark-based lower bounds, in which each landmark stores only the distances between it and vertices within its...
متن کاملShortest Path Using Neural Network
Shortest path problem is solved by using the famous Dijkstra's algorithm, which would quickly provide a global optimization solution in most instances. But when the weight is not given, this method does not work. This research paper examines and analyzes the use of neural networks for finding the weights. A neural network is an artificial representation of human brain that tries to simulate the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Investigation
سال: 2015
ISSN: 1742-2876
DOI: 10.1016/j.diin.2015.08.002